Non-reducibility of Isomorphism of Counterexamples to Vaught’s Conjecture to the Admissibility Equivalence Relation

نویسنده

  • WILLIAM CHAN
چکیده

Let T be a counterexample to Vaught’s conjecture. Let ET denote the isomorphism equivalence relation of T . Let Fω1 be the countable admissible ordinal equivalence relation defined on ω2 by x Fω1 y if and only if ωx 1 = ω y 1 . This note will show that in L and set-generic extensions of L, ¬(ET ≤∆11 Fω1 ). Using ZFC, if T is a non-minimal counterexample to Vaught’s conjecture, then ¬(ET ≤∆11 Fω1 ).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Borel Complexity of Isomorphism for Theories with Many Types

During the Notre Dame workshop on Vaught’s Conjecture, Hjorth and Kechris asked which Borel equivalence relations can arise as the isomorphism relation for models of a first order theory. In particular, they asked if the isomorphism relation can be essentially countable but not tame. We show this is not possible if the theory has uncountably many types. I am grateful to the logic group at Notre...

متن کامل

Equivalence Relations That Are Σ03 Complete for Computable Reducibility - (Extended Abstract)

Let E,F be equivalence relations on N. We say that E is computably reducible to F , written E ≤ F , if there is a computable function p : N→ N such that xEy ↔ p(x)Fp(y). We show that several natural Σ 3 equivalence relations are in fact Σ 3 complete for this reducibility. Firstly, we show that one-one equivalence of computably enumerable sets, as an equivalence relation on indices, is Σ 3 compl...

متن کامل

On the Complexity of the Uniform Homeomorphism Relation between Separable Banach Spaces

Recently, there has been a growing interest in understanding the complexity of common analytic equivalence relations between separable Banach spaces via the notion of Borel reducibility in descriptive set theory (see [Bos] [FG] [FLR] [FR1] [FR2] [Me]). In general, the notion of Borel reducibility yields a hierarchy (though not linear) among equivalence relations in terms of their relative compl...

متن کامل

On large cardinals and generalized Baire spaces

Working under large cardinal assumptions, we study the Borel-reducibility between equivalence relations modulo restrictions of the non-stationary ideal on some fixed cardinal κ. We show the consistency of E ++,λ++ λ-club , the relation of equivalence modulo the non-stationary ideal restricted to Sλ ++ λ in the space (λ++)λ ++ , being continuously reducible to E ++ λ+-club , the relation of equi...

متن کامل

Isomorphism relations on computable structures

We study the complexity of the isomorphism relation on classes of computable structures. We use the notion of FF -reducibility introduced in [9] to show completeness of the isomorphism relation on many familiar classes in the context of all Σ1 equivalence relations on hyperarithmetical subsets of ω.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017